more on this theme     |     more from this thinker     |     more from this text

---

Single Idea 9530

[filed under theme 4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / b. Terminology of PL ]

Full Idea

If a well-formed formula of propositional calculus takes at least one T and at least one F for all the assignments of truth-values to its variables, it is said to be 'contingent'.

Gist of Idea

A wff is 'contingent' if produces at least one T and at least one F

Source

E.J. Lemmon (Beginning Logic [1965], 2.3)

Book Ref

Lemmon,E.J.: 'Beginning Logic' [Nelson 1979], p.68